Algorithmic canonical stratifications of simplicial complexes

New methods for constructing shellable simplicial complexes

A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...

Minors of simplicial complexes

We extend the notion of a minor from matroids to simplicial complexes. We show that the class of matroids, as well as the class of independence complexes, is characterized by a single forbidden minor. Inspired by a recent result of Aharoni and Berger, we investigate possible ways to extend the matroid intersection theorem to simplicial complexes.

On Isomorphism of Simplicial Complexes and Their Related Algebras

Saturated simplicial complexes

Among shellable complexes a certain class has maximal modular homology, and these are the so-called saturated complexes. We extend the notion of saturation to arbitrary pure complexes and give a survey of their properties. It is shown that saturated complexes can be characterized via the p -rank of incidence matrices and via the structure of links. We show that rank-selected subcomplexes of sat...

Completions and Simplicial Complexes

We first introduce the notion of a completion. Completions are inductive properties which may be expressed in a declarative way and which may be combined. We show that completions may be used for describing structures or transformations which appear in combinatorial topology. We present two completions, 〈CUP〉 and 〈CAP〉, in order to define, in an axiomatic way, a remarkable collection of acyclic...